Once Punctured Disks, Non-Convex Polygons, and Pointihedra
نویسندگان
چکیده
منابع مشابه
Hiding disks in folded polygons
This paper considers the problem of nding a simple fold of a given polygon P that \hides" (covers both sides of) the largest possible disk. We solve this problem by giving a polynomial-time algorithm to nd the largest pair of equal-radius non-overlapping disks in a polygon P. The desired fold is then the perpendicular bisector of the centers of these two disks. We also present some conjectures ...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملConvexity of Sub-polygons of Convex Polygons
A convex polygon is defined as a sequence (V0, . . . , Vn−1) of points on a plane such that the union of the edges [V0, V1], . . . , [Vn−2, Vn−1], [Vn−1, V0] coincides with the boundary of the convex hull of the set of vertices {V0, . . . , Vn−1}. It is proved that all sub-polygons of any convex polygon with distinct vertices are convex. It is also proved that, if all sub-(n − 1)-gons of an n-g...
متن کاملOn k-convex polygons
We introduce a notion of k-convexity and explore polygons in the plane that have this property. Polygons which are k-convex can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of 2-convex polygons, a particularly interesting class, and show how to recognize them in O(n log n) time. A description of their sh...
متن کاملTilings of convex polygons
© Annales de l’institut Fourier, 1997, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2018
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-018-0393-1